Decision problems for propositional linear logic
نویسندگان
چکیده
منابع مشابه
Decision Problems for Propositional Linear Logic
Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. We show that unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable. Further, we prove that without the modal s torage operator, which indicates unboundedness of resources, the decision problem becomes PSPACE-Complete. We als...
متن کاملFinitisation for Propositional Linear Time Logic
Currently known sequent systems for propositional linear time temporal logic either include a cut rule in some form or an infinitary rule, which is a rule with infinitely many premises. We strengthen the infinitary rule to require only a finite number of premises and show that this modification preserves soundness. This way we obtain a finitary cut-free sequent system which almost fulfills the ...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملSpecifying Latin Square Problems in Propositional Logic
This chapter discusses how to specify various Latin squares so that their existence can be eeciently decided by computer programs. The computer programs considered here are so-called general-purpose model generation programs (or simply model generators) that are used to solve constraint satisfaction problems in AI, to prove theorems in nite domains, or to produce counterexamples to false conjec...
متن کاملPropositional Defeasible Logic has Linear Complexity
19 and has undergone a preliminary experimental evaluation [23]. It executes simple, but large, theories of basic defeasible logic very quickly. The linear complexity of the algorithm is supported empirically. However, the transformations used to convert an arbitrary defeasible theory to the appropriate form for the algorithm of Figure 1 impose a large constant factor, particularly on the cost ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1992
ISSN: 0168-0072
DOI: 10.1016/0168-0072(92)90075-b